Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
631	CASN Graduate Studies and NP Educators’ Forum Monday, November 14, 2011 7h00-16h10 Hilton Lac Leamy, Gatineau, Quebec Agenda Time Add to Reading List Source URL: www.casn.ca Language: English - Date: 2011-10-20 07:04:34 Complexity classes NP
632	Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks Vincenzo Bonifaci∗ , Alberto Marchetti-Spaccamela† , Nicole Megow‡ , Andreas Wiese§ ∗ Istituto di Analisi dei Sistemi ed Informatica “An Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-10-10 18:26:14 Operations research Applied mathematics Technology Rate-monotonic scheduling Scheduling Job shop scheduling Worst-case execution time Time complexity Dynamic priority scheduling Scheduling algorithms Real-time computing Theoretical computer science
633	Algorithms and Complexity for Periodic Real-Time Scheduling VINCENZO BONIFACI, Max Planck Institute for Informatics HO-LEUNG CHAN, University of Hong Kong ALBERTO MARCHETTI-SPACCAMELA, Sapienza University of Rome NICOLE Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-01-02 06:56:04 Complexity classes Mathematical optimization Analysis of algorithms Time complexity NP P versus NP problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
634	When months are numbered while days are not —Korean Children’s acquisition of time words The difficulties that children have in thinking about time concepts may result from the complexity of time as a concept, but ma Add to Reading List Source URL: jk.mit.edu Language: English - Date: 2013-07-12 21:49:46 Language acquisition Names of the days of the week Winnie-the-Pooh Era Week Go Time Science Units of time Dow Jones Industrial Average Dow
635	A Fast Algorithm for Approximate Quantiles in High Speed Data Streams Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2007-11-08 11:58:27 Analysis of algorithms Computational complexity theory Algorithms Time complexity Streaming algorithm Merge sort In-place algorithm Asymptotically optimal algorithm Applied mathematics Mathematics Computer science
636	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries? David Bremner1 , Erik Demaine2 , Jeff Erickson3 , John Iacono4 , Stefan Langerman5 , Pat Morin6 , and Godfried Toussaint7 1 Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:59 Theoretical computer science Computational geometry Delaunay triangulation Voronoi diagram Quicksort Convex hull algorithms Convex hull Time complexity Euclidean minimum spanning tree Geometry Mathematics Triangulation
637	BRICS Basic Research in Computer Science BRICS RS[removed]Frandsen et al.: Lower Bounds for Dynamic Algebraic Problems Lower Bounds for Add to Reading List Source URL: www.brics.dk Language: English - Date: 1998-09-17 06:32:33 Matrix theory Binary operations Determinants Abstract algebra Matrix Multiplication Time complexity Discrete Fourier transform Vector space Algebra Mathematics Linear algebra
638	6.851: Advanced Data Structures Spring 2012 Lecture 14 — April 10, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-22 12:47:48 Theoretical computer science Integer sorting Radix sort Bitonic sorter Merge sort Priority queue Binary logarithm Time complexity Trie Sorting algorithms Mathematics Order theory
639	Time-Lock Puzzles in the Random Oracle Model Mohammad Mahmoody1 , Tal Moran2 , and Salil Vadhan?2 1 Department of Computer Science, Cornell University [removed]; http://www.cs.cornell.edu/˜mohammad/ Add to Reading List Source URL: people.seas.harvard.edu Language: English - Date: 2011-06-17 11:55:54 Computational complexity theory Computability theory Random oracle Advantage Oracle machine Oracle Database Low Oracle Corporation IP Cryptography Theoretical computer science Applied mathematics
640	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine and Srini Devadas September 15, 2011 Problem Set 2 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-09-25 21:36:41 Computer science Programming idioms Computational complexity theory Asymptotic analysis Recursion Theory of computation Rendering Big O notation Time complexity Theoretical computer science Analysis of algorithms Mathematics

UPDATE